Scott Continuity in Generalized Probabilistic Theories
نویسندگان
چکیده
منابع مشابه
Structure of Optimal State Discrimination in Generalized Probabilistic Theories
We consider optimal state discrimination in a general convex operational framework, so-called generalized probabilistic theories (GPTs), and present a general method of optimal discrimination by applying the complementarity problem from convex optimization. The method exploits the convex geometry of states but not other detailed conditions or relations of states and effects. We also show that p...
متن کاملScott Domains Generalized Ultrametric Spaces and Generalized Acyclic Logic Programs
Every Scott domain can be viewed as a generalized ultrametric space with proper ties which allow to apply a generalization of the Banach contraction mapping theorem We will give this construction in detail and apply it to a class of programs which is stricly larger than the class of all acyclic programs The paper is taken from Hit Chapter Domains as Generalized Ultrametric Spaces We rst introdu...
متن کاملComputation in generalised probabilistic theories
From the general difficulty of simulating quantum systems using classical systems, and in particular the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation is that BQP ⊆ AWPP, where AWPP is a classical complexity cla...
متن کاملProbabilistic Inference Modulo Theories
We present SGDPLL(T ), an algorithm that solves (among many other problems) probabilistic inference modulo theories, that is, inference problems over probabilistic models defined via a logic theory provided as a parameter (currently, propositional, equalities on discrete sorts, and inequalities, more specifically difference arithmetic, on bounded integers). While many solutions to probabilistic...
متن کاملProbabilistic Constraint Logic Theories
Probabilistic logic models are used ever more often to deal with the uncertain relations typical of the real world. However, these models usually require expensive inference procedures. Very recently the problem of identifying tractable languages has come to the fore. In this paper we consider the models used by the learning from interpretations ILP setting, namely sets of integrity constraints...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2020
ISSN: 2075-2180
DOI: 10.4204/eptcs.318.5